Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes
نویسندگان
چکیده
We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O’Sullivan [8] based on Gröbner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander [2]. Our generalization enables us to apply the fast algorithm to compute a Gröbner basis of a module proposed by Lee and O’Sullivan [8], which was not possible in another generalization by Lax [7].
منابع مشابه
List decoding algorithms based on Gröbner bases for general one-point AG codes
We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O’Sullivan [18] based on Gröbner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander [4]. By using the same principle, we also generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amorós and O’Sullivan...
متن کاملList Decoding Algorithm based on Voting in Gröbner Bases for General One-Point AG Codes
We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amorós, and O’Sullivan [31] to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construction, prove equality between its error correcting capa...
متن کاملList Decoding Algorithm based on Voting in Groebner Bases for General One-Point AG Codes
We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amorós and O’Sullivan to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construction, analyze its error correcting capability that has not b...
متن کاملMagma Implementation of Decoding Algorithms for General Algebraic Geometry Codes
Goppa’s codes on algebraic curves defined over finite fields, called AG codes, are usually regarded as the most successful class of error correcting codes in theory as well as in practice. The class of AG codes provides series of constructible codes with large minimum distance that surpasses the Gilbert-Varshamov bound. Through the 80’s and 90’s, researchers devised efficient decoding algorithm...
متن کاملList Decoding of Hermitian Codes using Groebner Bases
List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Gröbner bases of modules. The computational complexity of the algorithm seems comparable to previously known algorithms achieving the same task, and the algorithm is better suited for hardware implementation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 55 شماره
صفحات -
تاریخ انتشار 2013